Quasi-cyclic codes with cyclic constituent codes
نویسندگان
چکیده
منابع مشابه
Good Quasi-Cyclic Codes Derived From Irreducible Cyclic Codes
As a generalization of cyclic codes, quasi-cyclic codes contain many good linear codes. Extensive search is made and lots of good quasi-cyclic codes are obtained from irreducible cyclic codes. A new binary [95, 13, 40] code which improves the lower bound on the minimum distance, is also constructed. Index Term — Codes and coding, linear codes, cyclic codes, idempotent, irreducible codes, quasi-...
متن کاملOn cyclic codes and quasi-cyclic codes over Zq + uZq
Let R = Zq + uZq, where q = p and u = 0. In this paper, some structural properties of cyclic codes and quasi-cyclic (QC) codes over the ring R are considered. A QC code of length ln with index l over R is viewed both as in the conventional row circulant form and also as an R[x]/(x − 1)-submodule of GR(R, l)[x]/(x − 1), where GR(R, l) is the Galois extension ring of degree l over R. A necessary ...
متن کاملOn quasi-cyclic codes as a generalization of cyclic codes
In this article we see quasi-cyclic codes as block cyclic codes. We generalize some properties of cyclic codes to quasi-cyclic ones such as generator polynomials and ideals. Indeed we show a one-to-one correspondence between l-quasi-cyclic codes of length lm and ideals of Ml(Fq)[X]/(X m −1). This permits to construct new classes of codes, namely quasi-BCH and quasi-evaluation codes. We study th...
متن کاملQuasi-cyclic subcodes of cyclic codes
We completely characterize possible indices of quasi-cyclic subcodes in a cyclic code for a very broad class of cyclic codes. We present enumeration results for quasi-cyclic subcodes of a fixed index and show that the problem of enumeration is equivalent to enumeration of certain vector subspaces in finite fields. In particular, we present enumeration results for quasi-cyclic subcodes of the si...
متن کاملSkew Generalized Quasi-cyclic Codes
This article discusses skew generalized quasi-cyclic codes over any finite field F with Galois automorphism θ. This is a generalization of quasi-cyclic codes and skew polynomial codes. These codes have an added advantage over quasi-cyclic codes since their lengths do not have to be multiples of the index. After a brief description of the skew polynomial ring F[x; θ], we show that a skew general...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 2007
ISSN: 1071-5797
DOI: 10.1016/j.ffa.2005.11.006